RBF和RSM在恒温超声波提取红景天苷工艺设计中的应用

依据正交实验研究各种影响因素,建立RBF人工神经网络模型,应用于RSM实验优化,得到最佳实验条件是料液比为1:20 g/mL,浸液时间为1.5h,温度为60℃,提取时间为20 min,提取次数为4,红景天苷提取率理论值可达到2.966%。     

樱桃红共振光散射光谱法测定牛血清白蛋白

研究了以樱桃红为共振光散射探针测定牛血清白蛋白的分析方法。在pH 3.58的BR缓冲溶液中,樱桃红与牛血清白蛋白(BSA)相互作用形成复合物,导致共振光散射(RLS)光谱明显增强,最大RLS峰位于340 nm处。由此建立检测痕量BSA的新方法。在优化实验条件下,RLS强度与BSA浓度的线性范围为1.0～60.0μg/mL,检出限为0.15μg/mL。方法可用于牛尿样品的分析。     

Novel radical tandem 1,6-enynes thioacylation/cyclization: Au–Pd nanoparticles catalysis versus thermal activation as a function of the substrate specificity

We studied the reactivity of 1,6-enynes with thioacetic acid (AcSH) under either thermal conditions or in the presence of catalytic amounts of supported Au or Au–Pd nanoparticles (NPs) under mild conditions. The 1,6-enynes undergo a tandem thioacylation/cyclization to original cyclic products featuring either a homoallylic thioester function or an enol thioester function depending on the substrate topology. Interestingly, the former process was found more efficient when performed in the presence of Au–Pd NPs while the latter process can be efficiently carried out under thermal conditions (100 °C). The reaction proceeds by a radical mechanism and the presence of precious metal NPs seems to stabilize the formation of free radical intermediates, as supported by experimental and theoretical results.     

The Rainbow Vertex-disconnection in Graphs

Let G be a nontrivial connected and vertex-colored graph. A subset X of the vertex set of G is called rainbow if any two vertices in X have distinct colors. The graph G is called rainbow vertex-disconnected if for any two vertices x and y of G, there exists a vertex subset S of G such that when x and y are nonadjacent, S is rainbow and x and y belong to different components of G-S; whereas when x and y are adjacent, S + x or S + y is rainbow and x and y belong to different components of(G-xy)-S. For a connected graph G, the rainbow vertex-disconnection number of G, denoted by rvd(G), is the minimum number of colors that are needed to make G rainbow vertexdisconnected. In this paper, we characterize all graphs of order n with rainbow vertex-disconnection number k for k ∈ {1, 2, n}, and determine the rainbow vertex-disconnection numbers of some special graphs. Moreover, we study the extremal problems on the number of edges of a connected graph G with order n and rvd(G) = k for given integers k and n with 1 ≤ k ≤ n.     

An Analogue-difference Method and Application to Induction Motor Models

The paper established a so-called analogue-difference method (ADM) to compute the numerical solutions for boundary value problems of higher-order differential equations, which can be a fundamental method and performs much better than the finite difference method (FDM), even for second-order boundary value problems. Numerical examples and results illustrate the simplicity, efficiency and applicability of the method, which also show that the proposed method has obvious advantages over the methods presented by recent state-of-the-art work for induction motor models.     

On chromatic uniqueness of certain 5-partite graphs

Let P(G,λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G～H, if P(G,λ)=P(H,λ). We write [G]={H∣H～G}. If [G]={G}, then G is said to be chromatically unique. In this paper, we first characterize certain complete 5-partite graphs with 5n+3 vertices according to the number of 6-independent partitions of G. Using these results, we investigate the chromaticity of G with certain star or matching deleted. As a by-product, many new families of chromatically unique complete 5-partite graphs with certain star or matching deleted are obtained.     

Determination of bisphenol A, 4‐octylphenol,and 4‐nonylphenol in soft drinks and dairy products by ultrasound‐assisted dispersive liquid–liquid microextraction combined with derivatization and high‐performance liquid chromatography with fluorescence detection

A novel hyphenated method based on ultrasound‐assisted dispersive liquid–liquid microextraction coupled to precolumn derivatization has been established for the simultaneous determination of bisphenol A, 4‐octylphenol, and 4‐nonylphenol by high‐performance liquid chromatography with fluorescence detection. Different parameters that influence microextraction and derivatization have been optimized. The quantitative linear range of analytes is 5.0–400.0 ng/L, and the correlation coefficients are more than 0.9998. Limits of detection for soft drinks and dairy products have been obtained in the range of 0.5–1.2 ng/kg and 0.01–0.04 μg/kg, respectively. Relative standard deviations of intra‐ and inter‐day precision for retention time and peak area are in the range of 0.47–2.31 and 2.76–8.79%, respectively. Accuracy is satisfactory in the range of 81.5–118.7%. Relative standard deviations of repeatability are in the range of 0.35–1.43 and 2.36–4.75% for retention time and peak area, respectively. Enrichment factors for bisphenol A, 4‐octylphenol, and 4‐nonylphenol are 170.5, 240.3, and 283.2, respectively. The results of recovery and matrix effect are in the range of 82.7–114.9 and 92.0–109.0%, respectively. The proposed method has been applied to the determination of bisphenol A, 4‐octylphenol, and 4‐nonylphenol in soft drinks and dairy products with much higher sensitivity than many other methods.     

Nonrepetitive colorings of graphs

A coloring of the vertices of a graph G is nonrepetitive if there is no even path in G whose first half looks the same as the second half. This notion arose as an analogue of the famous nonrepetitive sequences of Thue. We consider here the list analogue and the game analogue of nonrepetitive colorings.     

基于超图的超网络相继故障分析

分析了快递超网络和电子元件超网络的相继故障扩散方式, 结合超图理论提出了2-section 图分析法和线图分析法, 并仿真分析了无标度超网络耦合映像格子的相继故障进程. 结果表明: 无标度超网络对外部攻击表现出了既鲁棒又脆弱的特性. 针对相继故障的不同扩散方式, 无标度超网络的相继故障行为表现出不同的特点. 超网络的相继故障行为和超网络的超度以及超边度分布有密切的联系, 也和超网络中超边的个数有关. 通过和同规模的Barabasi-Albert (BA)无标度网络对比, 在同一种攻击方式下同规模的无标度超网络都比BA 无标度网络表现出了更强的鲁棒性. 另外, 基于超边扩散的相继故障进程比基于节点扩散的相继故障进程更加缓慢.     

Rainb ow Vertex-connection Numb er of Ladder and M¨obius Ladder

A vertex-colored graph G is said to be rainbow vertex-connected if every two vertices of G are connected by a path whose internal vertices have distinct colors, such a path is called a rainbow path. The rainbow vertex-connection number of a connected graph G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertex-connected. If for every pair u, v of distinct vertices, G contains a rainbow u-v geodesic, then G is strong rainbow vertex-connected. The minimum number k for which there exists a k-vertex-coloring of G that results in a strongly rainbow vertex-connected graph is called the strong rainbow vertex-connection number of G, denoted by srvc(G). Observe that rvc(G) ≤ srvc(G) for any nontrivial connected graph G. In this paper, for a Ladder Ln, we determine the exact value of srvc(Ln) for n even. For n odd, upper and lower bounds of srvc(Ln) are obtained. We also give upper and lower bounds of the (strong) rainbow vertex-connection number of M¨obius Ladder.